Off-line Constraint Propagation for Efficient HPSG Processing
نویسندگان
چکیده
We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a hpsg theory more speciic at those places where linguistically motivated underspeciication would lead to ineecient processing. We discuss two concrete hpsg examples showing how oo-line constraint propagation helps improve processing eeciency.
منابع مشابه
Oo-line Constraint Propagation for Eecient Hpsg Processing
We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a hpsg theory more speciic at those places where linguistically motivated underspeciication would lead to ineecient processing. We discuss two concrete hpsg examples showing how oo-line constraint propagation helps improve processing eeciency.
متن کاملOff-line Optimization for Earley-style HPSG Processing
A novel approach to HPSG based natural language processing is described that uses an off-line compiler to automatically prime a declarative grammar for generation or parsing, and inputs the primed grammar to an advanced Earley-style processor. This way we provide an elegant solution to the problems with empty heads and efficient bidirectional processing which is illustrated for the special case...
متن کاملCompiling HPSG Type Constraints into Definite Clause Programs
We present a new approach to HPSG processing: compiling HPSG grammars expressed as type constraints into definite clause programs. This provides a clear and computationally useful correspondence between linguistic theories and their implementation. The compiler performs off-line constraint inheritance and code optimization. As a result, we are able to efficiently process with HPSG grammars with...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملKorean Phrase Structure Grammar and Its Implementations into the LKB System
Though there exist various morphological analysers developed for Korean, no serious attempts have been made to build its syntactic or semantic parser(s), partly because of its structural complexity and partly because of the existence of no reliable grammar-build up system. This paper presents a result of our on-going project to build up a computationally feasible Korean Phrase Structure Grammar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cmp-lg/9604010 شماره
صفحات -
تاریخ انتشار 1996